Traversal-Time Distribution for a Classical Time-Modulated Barrier
نویسنده
چکیده
The classical problem of a time-modulated barrier, inspired by the Büttiker and Landauer model to study the tunneling times, is analyzed. We show that the traversaltime distribution of an ensemble of non-interacting particles that arrives at the oscillating barrier, obeys a distribution with a power-law tail.
منابع مشابه
On The Moments Of The Time To Ruin Distribution When The Initial Reserve Is Large And Claim Amount Distribution Is Two Stage Hypo Exponential Distribution
In any classical risk model one of the important random variable is time to ruin. As time to ruin warns the management for possible adverse situations that may arise, the distribution of time to ruin place a vital role in the day to day transactions of the any insurance company. Moments of the distribution are also important as coefficient of skewness of the distribution is very important in ac...
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملChaotic properties of a time-modulated barrier.
Some chaotic properties of a classical particle interacting with a time-modulated barrier are studied. The dynamics of this problem is obtained by use of a two-dimensional nonlinear area-preserving map. The chaotic low energy region is characterized in terms of Lyapunov exponents. The time that the particle stays trapped in the well is such that the distributions of successive reflections, and ...
متن کاملA New Approach to Approximate Completion Time Distribution Function of Stochastic Pert Networks
The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a network by a given deadline. However, in general, such a path is not the most critical path (MCP) and does not have the smallest estimate for the probability of completion time. The main idea of this paper is derived from the domination structure between ...
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999